#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#include<functional>
#include<cstring>
#define ll long long
#define ull unsigned long long
using namespace std;

const int N = 510, INF = 0x3f3f3f3f;

int n, m;
vector<int> g[N];
int in[N];

void solve()
{
    while (cin >> n >> m) {
        memset(in, 0, sizeof in);
        for (int i = 1;i <= n;i++) g[i].clear();
        for (int i = 1;i <= m;i++) {
            int x, y;cin >> x >> y;
            g[x].push_back(y);
            in[y]++;
        }
        for (int i = 1;i <= n;i++) sort(g[i].begin(), g[i].end());
        vector<int> ans;
        priority_queue<int, vector<int>, greater<int> > q;
        for (int i = 1;i <= n;i++)if (in[i] == 0) q.push(i);
        while (!q.empty()) {
            int x = q.top();q.pop();
            ans.push_back(x);
            for (int y : g[x]) {
                in[y]--;
                if (in[y] == 0) q.push(y);
            }
        }
        for (int i = 0;i < ans.size() - 1;i++)
            cout << ans[i] << " ";
        cout << ans.back() << '\n';
    }
}

signed main()
{
    //ios::sync_with_stdio(0);
    //cin.tie(0);cout.tie(0);
#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
    std::istringstream in(R"()");
    std::cin.rdbuf(in.rdbuf());
#endif
    int T = 1;
    //cin>>T;
    for (int i = 1;i <= T;i++) {
        solve();
    }
}